Lossy compression of individual signals based on string matching and one pass codebook design

نویسندگان

  • Christopher Chan
  • Martin Vetterli
چکیده

This paper describes an eeort to extend the Lempel-Ziv algorithm to a practical universal lossy compression algorithm. It is based on the idea of approximate string matching with a rate-distortion (R ? D) criterion, and is addressed within the framework of vector quantiza-tion (VQ) 4]. A practical one pass algorithm for VQ codebook construction and adaptation for individual signals is developed which assumes no prior knowledge of the source statistics and involves no iteration. We call this technique rate-distortion Lempel-Ziv (RDLZ). As in the case of the Lempel-Ziv algorithm, the encoded bit stream consists of codebook (dictionary) updates as well as indices (pointers) to the codebook. The idea of \trading" bits for distortion in modifying the codebook will be introduced. Experimental results show that, for Gaussian sources as well as real images, RDLZ performs comparably, sometimes favorably, to static code-book VQ trained on the corresponding sources or images .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lossy Compression of Individual Signals based on One Pass Codebook Adaptation by

Lossy Compression of Individual Signals based on One Pass Codebook Adaptation Christopher Chan Universal lossless codes have been proven to exist [5], and practical universal lossless coding schemes have been constructed [27, 6]. Given the attractive property of a universal code, namely that it can achieve an asymptotic rate approaching the entropy of the source, without knowledge about the sou...

متن کامل

Natural type selection in adaptive lossy compression

Consider approximate (lossy) matching of a source string , with a random codebook generated from reproduction distribution , at a specified distortion . Recent work determined the minimum coding rate 1 = ( ) for this setting. We observe that for large word length and with high probability, the matching codeword is typical with a distribution 1 which is different from . If a new random codebook ...

متن کامل

A String Matching Interpretation for the Arimoto-Blahut Algorithm

| The Arimoto-Blahut (AB) algorithm is an iterative procedure for computing the rate-distortion function for a given source and distortion measure. It starts with an arbitrary (strictly positive) reproduction distribution, and iteratively produces a sequence of reproduction distributions (and corresponding rates) that converges to the point of prespeciied slope on the rate-distortion curve, and...

متن کامل

A Lossy Data Compression Based on String Matching: Preliminary Analysis and Suboptimal Algorithms

A practical suboptimal algorithm (source coding) for lossy (non-faithful) data compression is discussed. This scheme is based on an approximate string matching, and it naturally extends lossless (faithful) Lempel-Ziv data compression scheme. The construction of the algorithm is based on a careful probabilistic analysis of an approximate string matching problem that is of its own interest. This ...

متن کامل

The index entropy of a mismatched codebook

We show that if a random codebook for lossy source coding is generated by a non-optimum reproduction distribution Q, then the entropy of the index of the D-matching codeword is reduced by conditioning on the codebook: the number of bits saved is equal to the divergence between the \favorite type" in the codebook and the generating distribution Q. Speciic examples are provided.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995